Is DNA computing viable for 3-SAT problems?
نویسندگان
چکیده
منابع مشابه
An algorithm for 3-SAT problems
This paper presents an algorithm for 3-SAT problems. First, logical formulas are transformed into elementary algebraic formulas. Second, complex trigonometric functions are assigned to the variables in the elementary algebraic formulas, and the sums of the formulas are calculated. The algorithm outputs the number of satisfying assignments. The computational complexity of the algorithm is probab...
متن کاملAn Evolutionary Framework for 3-SAT Problems
In this paper we present a new evolutionary framework for 3-SAT. This method can be divided into three stages, where each stage is an evolutionary algorithm. The first stage improves the quality of the initial population. The second stage improves the speed of the algorithm periodically generating new solutions. The 3rd stage is a hybrid evolutionary algorithm, which improves the solutions with...
متن کاملA Flipping Genetic Algorithm for Hard 3-SAT Problems
In this paper we propose a novel heuristic based genetic algorithm for solving the satis-ability problem. The idea is to act repeatedly on a population of candidate solutions: at each iteration, rst a simple local search procedure is applied to each element of the population; next the genetic operators (selection , recombination and mutation) are applied to the resulting population. Extensive e...
متن کاملDynamic Variable Filtering for Hard Random 3-SAT Problems
The DPL (Davis-Putnam-Logemann-Loveland) procedure is one of the most effective methods for solving SAT problems. It is well known that its efficiency depends on the choice of the branching rule. One of the main improvements of this decision procedure has been the development of better branching variable selection through the use of unit propagation look-ahead (UPLA) heuristics (e.g., [13]). UP...
متن کاملSelection of search strategies for solving 3-SAT problems
The paper concerns the problem of Boolean satisfiability checking, which is recognized as one of the most important issues in the field of modern digital electronic system verification and design. The paper analyzes different strategies and scenarios of the proving process, and presents a modified and extended version of the author’s FUDASAT algorithm. The original FUDASAT methodology is an int...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(02)00533-9